Äääêì¹äííïááë¹íaeáîîêëáìì Êêááíê Áaeëìáìíì Ê Áaeaeçêååìáã

Äääêì¹äííïááë¹íaeáîîêëáì Ì Êêááíê Áaeëìáìíì Íê Áaeaeçêååìáã

Áaeëìáìíì Íê Áaeaeçêååìáã

Áaeëìáìíì Íê Áaeaeçêååìáã

Áaeëìáìíì Íê Áaeaeçêååìáã

Áaeëìáìíì Íê Áaeaeçêååìáã

Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. This paper shows how to model our timetabling problem as a partial constraint satisfaction problem and ...